منابع مشابه
Periodicity and local complexity
We consider the complexity of bi-in,nite words in one and two dimensions. A result of Morse and Hedlund in one dimension states that if the complexity, p (n), of a word satis,es p (n)6 n for some n, then the word is periodic. The corresponding question in two dimensions (whether p (m; n)6mn implies that is periodic) is known as the Nivat conjecture. In this paper, we strengthen the one-dimensio...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولEvaluation of Growth Performance of Local and Dorper × Local Crossbred Sheep in Eastern Amhara Region, Ethiopia
The present study was performed to evaluate the on-station growth performance of local and Dorper × local crossbred sheep in eastern Amhara region, Ethiopia. Data on 302 lambs collected over a 4-year period (2009 to 2012) on local and Dorper × local crossbred sheep at Sirinka breeding, evaluation and distribution site were used in this study. Fixed effects considered were breed, lamb sex, birth...
متن کاملDetermining Injury-Relatedness, Work-Relatedness, and Claim-Relatedness
The American Medical Association’s Guides to the Evaluation of Disease and Injury Causation (Causation)1 is an important component of the AMA Guides library. This text delineates a type of evaluation that is distinctly different from a diagnostic evaluation, a treatment planning evaluation, a prognosis evaluation, or an impairment evaluation. It provides a protocol for determining whether a cli...
متن کاملA New Family of String Classifiers Based on Local Relatedness
This paper introduces a new family of string classifiers based on local relatedness. We use three types of local relatedness measurements, namely, longest common substrings (LCStr’s), longest common subsequences (LCSeq’s), and window-accumulated longest common subsequences (wLCSeq’s). We show that finding the optimal classier for given two sets of strings (the positive set and the negative set)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2019
ISSN: 1556-5068
DOI: 10.2139/ssrn.3477051